An accessible yet rigorous crash course on recursive programming using Python and JavaScript examples。

Recursion， and recursive algorithms， have a reputation for being intimidating。 They're seen as an advanced computer science topic often brought up in coding interviews。 Moreover， coders often perceive the use of a recursive algorithm as a sophisticated solution that only true programmers can produce。 But there's nothing magical about recursion。 Its fearsome reputation is more a product of poor teaching than of the complexity of recursion itself。

This book teaches the basics of recursion， exposes the ways it's often poorly taught， and clarifies the fundamental principles behind all recursive algorithms。 It is project-based， containing complete， runnable programs in both Python and JavaScript， and covers several common recursive algorithms for tasks like calculating factorials， producing numbers in the Fibonacci sequence， tree traversal， maze solving， binary search， quicksort and merge sort， Karatsuba multiplication， permutations and combinations， and solving the eight queens problem。

The book also explains tail call optimization and memoization， concepts often employed to produce effective recursive algorithms， and the call stack， which is a critical part of how recursive functions work but is almost never explicitly pointed out in lessons on recursion。 The last chapter， on fractals， culminates with examples of the beautiful fractal shapes recursion can produce。